Diffie-Hellman Technique Extended to Efficient and Simpler Group Key Distribution Protocol
نویسنده
چکیده
Ever since 2-party Diffie-Hellman exchange was first proposed in 1976, there have been efforts to extend its simplicity and elegance to a group setting. Notable solutions have been proposed by michael Steiner Gene Tsudik Waidner(in 1996) and Recently G.P.Biswas was proposed a contributory group key agreement protocol for generation of multiparty key and compared with other protocol and satisfactory results obtained. In this paper an m-party DH key distribution for group (improved group DH) was proposed by modifying G.P.Biswas protocol and we argued that our protocol is optimal with respect to most of the aspects of protocol complexity and also it‟s security discussed.
منابع مشابه
A NEW PROTOCOL MODEL FOR VERIFICATION OF PAYMENT ORDER INFORMATION INTEGRITY IN ONLINE E-PAYMENT SYSTEM USING ELLIPTIC CURVE DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL
Two parties that conduct a business transaction through the internet do not see each other personally nor do they exchange any document neither any money hand-to-hand currency. Electronic payment is a way by which the two parties transfer the money through the internet. Therefore integrity of payment and order information of online purchase is an important concern. With online purchase the cust...
متن کاملElliptic Curve Based Dynamic Contributory Group Key Agreement Protocol for Secure Group Communication over Ad-hoc Networks
The aim of this paper is to propose an efficient and simpler Contributory Group Key Agreement protocol (CGKA) based on Elliptic Curve Diffie Hellman (ECDH). In this CGKA protocol, a member acts as a group controller (GC) and forms two-party groups with remaining group members and generates an ECDH-style shared key per each two-party group. It then combines these keys into a single group key and...
متن کاملThe Group Diffie-Hellman Problems(Extended abstract)
In this paper we study generalizations of the Diffie-Hellman problems recently used to construct cryptographic schemes for practical purposes. The Group Computational and the Group Decisional DiffieHellman assumptions not only enable one to construct efficient pseudorandom functions but also to naturally extend the Diffie-Hellman protocol to allow more than two parties to agree on a secret key....
متن کاملDiffie-Hellman technique: extended to multiple two-party keys and one multi-party key
Diffie –Hellman technique: extended to multiple two-party keys and one multi-party key Abstract: The two-party Diffie– Hellman (DH) key-exchanging technique is extended to generate (i) multiple two-party keys and (ii) one multi-party key. The participants in the former case exchange two public keys and generate 15 shared keys. Of these, 4 keys are called base keys, because they are used to gene...
متن کاملECDH-based Scalable Distributed Key Management Scheme for Secure Group Communication
With the popularity of group-oriented applications, secure and efficient communication among all group members has become a major issue. An efficient key management mechanism is the base and critical technology of secure group communications. A distributed grouporiented key management scheme without the participation of third parties is proposed in the paper. The scheme deploys Elliptic Curve D...
متن کامل